Parallel Implementation of the Full Search Block Matching Algorithm for Motion Estimation - Application Specific Array Processors, 1995. Proceedings., International Conference on
نویسندگان
چکیده
Motion estimation is a key technique in most algorithms for video compression and particularly in the MPEG and H.261 standards. The most frequently used technique is based on a Full Search Block Matching Algorithm which is highly computing intensive and requires the use of special purpose architectures to obtain real-time performance. In this paper we propose an approach to the parallel implementation of the Full Search Block Matching Algorithm which is suitable for implementation on massively parallel architectures ranging from large scale SIMD computers to dedicated processor arrays realized in ASICs. While the first altemative can be used for the implementation of high performance coders the second alternative is particularly attractive f o r low cost video compression devices. This paper describes the approach proposed for the parallel implementation of the Full Search Block Matching Algorithm and the implementation of such an approach in an ASIC.
منابع مشابه
Parallel Implementation of the Full Search Block Matching Algorithm for Motion Estimation
Motion estimation is a key technique in most algorithms for video compression and particularly in the MPEG and H.261 standards. The most frequently used technique is based on a Full Search Block Matching Algorithm which is highly computing intensive and requires the use of special purpose architectures to obtain real-time performance. In this paper we propose an approach to the parallel impleme...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملAutomatic Synthesis of Motion Estimation Processors Based on a New Class of Hardware Architectures
A new class of fully parameterizable multiple array architectures for motion estimation in video sequences based on the Full-Search Block-Matching algorithm is proposed in this paper. This class is based on a new and efficient AB2 single array architecture with minimum latency, maximum throughput and full utilization of the hardware resources. It provides the ability to configure the target pro...
متن کاملA New Efficient VLSI Architecture for Full Search Block Matching Motion Estimation
A new efficient type I architecture for motion estimation in video sequences based on the Full-Search Block-Matching (FSBM) algorithm is proposed in this paper. This architecture presents minimum latency, maximum throughput and full utilization of the hardware resources, combining both pipelining and parallel processing techniques. The implementation of an array processor for motion estimation ...
متن کاملEFBLA: A Two-Phase Matching Algorithm for Fast Motion Estimation
Introduction: The most popular algorithm for the VLSI implementation of motion estimation is the block-based full-search algorithm [1–3]. However, the full-search algorithm notoriously needs high computation load and large memory size. The high computational cost has become a major problem in the implementation of motion estimation. Many papers have proposed different ways to reduce the computa...
متن کامل